Correcting Illegal NP Omissions Using Local Focus
نویسنده
چکیده
1 I N T R O D U C T I O N The work described here is in the context of developing a system that will correct the written EnliSh of native users of American Sign Language SL) who are learning English as a second language. In this paper we focus on one error class that we have found to be particularly prevalent: the illegal omission of NP's. Our previous analysis of the written English of ASL natives has led us to conclude that language transfer (LT) can explain many errors, and should thus be taken advantage of by an instructional system (Suri, 1991; Suri and McCoy, 1991). We believe that many of the omission errors we have found are among the errors explainable by LT. Lillo-Martin (1991) investigates null argument structures in ASL. She identifies two classes of ASL verbs that allow different types of null argument structures. Plain verbs do not carry morphological markings for subject or object agreement and yet allow null argument structures in some contexts. These structures, she claims, are analogous to the null argument structures found in languages (like Chinese) that allow a null argument if the argument co-specifies the topic of a previous sentence (ttuang, 1984). Such languages are said to be discourseoriented languages. As it turns out, our writing samples collected from deaf writers contain many instances of omitted NP's where those NP's are the topic of a previous sentence and where the verb involved would be a plain verb in ASL. We believe these errors can be explained as a result of the ASL native carrying over conventions of (discourse-oriented) ASL to (sentence-oriented) English. If this is the case, then these omissions can be corrected if we track the topic, or, in computational linguistics terms, the local focus, and the actor focus. 2 We propose to do this by developing a modified version of Sidner's focus tracking algorithm (1979, 1983) that includes mechanisms for handling complex sentence types and illegally omitted NP's.
منابع مشابه
On the Minimum Degree Up to Local Complementation: Bounds and Complexity
The local minimum degree of a graph is the minimum degree reached by means of a series of local complementations. In this paper, we investigate on this quantity which plays an important role in quantum computation and quantum error correcting codes. First, we show that the local minimum degree of the Paley graph of order p is greater than √ p− 3 2 , which is, up to our knowledge, the highest kn...
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملThe Major Functions of the NP
Dryer for providing helpful comments on several versions of this paper. Remaining errors and omissions are my own.
متن کاملImprovements of the Attacks on Cryptosystems Based on Error-correcting Codes Improvements of the Attacks on Cryptosystems Based on Error-correcting Codes Improvements of the Attacks on Cryptosystems Based on Error-correcting Codes
Many public-key cryptosystems and identiication schemes based on error-correcting codes have been proposed as an alternative to the common cryptographic algorithms based on number theory. They rely on the NP-hardness of nding a xed-weight word in a coset of a linear binary code. We here improve the previous attacks on these systems; this notably enables us to reduce the work factor involved in ...
متن کامل